Virtual Global Search: Application to 9×9 Go
نویسنده
چکیده
Monte-Carlo simulations can be used as an evaluation function for Alpha-Beta in games. If w is the width of the search tree, d its depth, and g the number of simulations at each leaf, the total number of simulations is at least g× (2× w 2 ). In games where moves permute, we propose to replace this algorithm by another algorithm that only needs g × 2 simulations for a similar number of games per leaf. The algorithm can also be applied to games where moves often but not always permute, such as Go. We detail its application to 9x9 Go.
منابع مشابه
Exploration exploitation in Go: UCT for Monte-Carlo Go
Algorithm UCB1 for multi-armed bandit problem has already been extended to Algorithm UCT which works for minimax tree search. We have developed a Monte-Carlo program, MoGo, which is the first computer Go program using UCT. We explain our modifications of UCT for Go application, among which efficient memory management, parametrization, ordering of non-visited nodes and parallelization. MoGo is n...
متن کاملVirtual Global Search: Application to 9x9 Go
Monte-Carlo simulations can be used as an evaluation function for Alpha-Beta in games. If w is the width of the search tree, d its depth, and g the number of simulations at each leaf, the total number of simulations is at least g × (2 × w 2 ). In games where moves permute, we propose to replace this algorithm by another algorithm that only needs g × 2 simulations for a similar number of games p...
متن کاملAssociating Shallow and Selective Global Tree Search with Monte Carlo for 9*9 Go
This paper explores the association of shallow and selective global tree search with Monte Carlo in 9x9 go. This exploration is based on Olga and Indigo, two experimental Monte Carlo programs. We provide a min-max algorithm that iteratively deepens the tree until one move at the root is proved to be superior to the other ones. At each iteration, random games are started at leaf nodes to compute...
متن کاملParallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the strength of any Go program. In this article, we discuss three parallelization methods for MCTS: leaf parallelization, root parallelization, and tree parallelization. To be effective tree parallelization requires two techni...
متن کاملOptimisation of assembly scheduling in VCIM systems using genetic algorithm
Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is ...
متن کامل